A Simplified NP-Complete MAXSAT Problem
نویسندگان
چکیده
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears in at most three clauses, we give an exact algorithm for MAXSAT that takes at most O(3 n=2 n) steps where n is the number of variables.
منابع مشابه
Pakota: A System for Enforcement in Abstract Argumentation
In this paper we describe Pakota, a system implementation that allows for solving enforcement problems over argumentation frameworks. Via harnessing Boolean satisfiability (SAT) and Maximum satisfiability (MaxSAT) solvers, Pakota implements algorithms for extension and status enforcement under various central AF semantics, covering a range of NP-complete—via direct MaxSAT encodings—and Σ2 -comp...
متن کاملParameterized Complexity of MaxSat above Average
In MaxSat, we are given a CNF formula F with n variables and m clauses and asked to find a truth assignment satisfying the maximum number of clauses. Let r1, . . . , rm be the number of literals in the clauses of F . Then asat(F ) = ∑m i=1(1 − 2 −ri) is the expected number of clauses satisfied by a random truth assignment (the truth values to the variables are distributed uniformly and independ...
متن کاملApproximation Algorithms for Maxsat
The main aim of NP-completeness theory is the analysis of intractabil-ity. Many optimization problems were rst proved to be NP-hard. Since the complete solution of these problems requires exponential time, polynomial time algorithms to nd \near-optimal" solutions, i.e., approximation algorithms, appear to be viable. In this paper we show the basic principles of Approximation Theory for NP-compl...
متن کاملGenetic Algorithm Behavior in the MAXSAT Domain
Random Boolean Satissability function generators have recently been proposed as tools for studying genetic algorithm behavior. Yet MAXSAT problems exhibit extremely limited epistasis. Furthermore , all nonzero Walsh coeecients can be computed exactly for MAXSAT problems in polynomial time using only the clause information. This means the low order schema averages can be computed quickly and exa...
متن کاملApproximating Succinct MaxSat
We study the approximability of the version of MaxSat where exponentially large instances are succinctly represented using circuits. First, we prove that the NP-hardness for approximating MaxSat can be lifted to a corresponding NEXP-hardness for approximating circuitsuccinct MaxSat for some constant performance ratio. Second, we consider the approximability of circuit-succinct MaxSat with respe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 65 شماره
صفحات -
تاریخ انتشار 1998